Development of Solving Slab Stacking Problem by Set Partitioning Approach
نویسندگان
چکیده
منابع مشابه
Heuristic Algorithms for Solving the Set-partitioning Problem
A delivery problem which reduces to the NP-complete set-partitioning problem is investigated. The 3-opt, simulated annealing, tabu search and ant algorithms to solve the delivery problem are discussed.
متن کاملSolving the Fixed Charge Transportation Problem by New Heuristic Approach
The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...
متن کاملSolving Set Partitioning Problems with Constraint Programming
This paper investigates the potential of constraint programming for solving set partitioning problems occurring in crew scheduling, where constraint programming is restricted to not employ external solvers, as for instance integer linear programming solvers. We evaluate preprocessing steps known from the OR literature on moderately sized set partitioning problems. Further, we propose a new prep...
متن کاملAn Independent Set Approach to Solving the Collaborative Attack Problem
Access control in distributed databases has tended to favor a hierarchical approach implemented via cryptographic schemes. In such schemes, a central authority generates keys for each level in the hierarchy such that users at a given level can compute, from their own key, the keys of users below them and gain access to information items they hold. Previous schemes proposed, have been found to b...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 2018
ISSN: 0453-4654,1883-8189
DOI: 10.9746/sicetr.54.298